Some Programming Languages Suggested by Game Models (Extended Abstract)
نویسنده
چکیده
We consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it. In each case, we present an extension of Plotkin’s language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types. The quest for such languages results in a novel selection of language primitives for state encapsulation, coroutining and backtracking.
منابع مشابه
Some Programming Languages Suggested by Game Models ( Extended
We consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it. In each case, we present an extension of Plotkin’s language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types. The quest for such languages results in a novel selection of language primitives for...
متن کاملExplorer Some Programming Languages Suggested by Game Models ( Extended
We consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it. In each case, we present an extension of Plotkin’s language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types. The quest for such languages results in a novel selection of language primitives for...
متن کاملGame Programming as a Non-Threatening Introduction to Functional Languages
In this paper, we explain a new analysis technique to guide CS students during the development of a videogame. This technique is so structured as to make students learn the basics of functional programming without even realizing it. We start by describing some of the difficulties associated with forcing a more abstract style of reasoning and a functional language to undergraduate students. Then...
متن کاملLinearity, Sharing and State: a Fully Abstract Game Semantics for Idealized Algol with Active Expressions Extended Abstract Abramsky and Mccusker
The manipulation of objects with state which changes over time is all-pervasive in computing. Perhaps the simplest example of such objects are the program variables of classical imperative languages. An important strand of work within the study of such languages, pioneered by John Reynolds, focusses on \Idealized Algol", an elegant synthesis of imperative and functional features. We present a n...
متن کاملALGORITHMIC GAME SEMANTICS A Tutorial Introduction
Game Semantics has emerged as a powerful paradigm for giving semantics to a variety of programming languages and logical systems. It has been used to construct the first syntax-independent fully abstract models for a spectrum of programming languages ranging from purely functional languages to languages with non-functional features such as control operators and locally-scoped references [4, 21,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 249 شماره
صفحات -
تاریخ انتشار 2009